Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position

نویسندگان

  • Chung-Meng Lee
  • Jimmy J. M. Tan
  • Lih-Hsing Hsu
چکیده

Assume that n is a positive integer with n 2. It is proved that between any two different vertices x and y of Qn there exists a path Pl(x,y) of length l for any l with h(x,y) l 2n − 1 and 2|(l − h(x,y)). We expect such path Pl(x,y) can be further extended by including the vertices not in Pl(x,y) into a hamiltonian path from x to a fixed vertex z or a hamiltonian cycle. In this paper, we prove that for any two vertices x and z from different partite set of n-dimensional hypercube Qn, for any vertex y ∈ V (Qn)− {x, z}, and for any integer l with h(x,y) l 2n − 1 − h(y, z) and 2|(l − h(x,y)), there exists a hamiltonian path R(x,y, z; l) from x to z such that dR(x,y,z;l)(x,y)= l. Moreover, for any two distinct vertices x and y of Qn and for any integer l with h(x,y) l 2n−1 and 2|(l − h(x,y)), there exists a hamiltonian cycle S(x,y; l) such that dS(x,y;l)(x,y)= l. © 2008 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position

It is proved that there exists a path Pl(x, y) of length l if dAQn (x, y) ≤ l ≤ 2n − 1 between any two distinct vertices x and y of AQn. Obviously, we expect that such a path Pl(x, y) can be further extended by including the vertices not in Pl(x, y) into a hamiltonian path from x to a fixed vertex z or a hamiltonian cycle. In this paper, we prove that there exists a hamiltonian path R(x, y, z; ...

متن کامل

On the Enhanced Hyper-hamiltonian Laceability of Hypercubes

A bipartite graph is hamiltonian laceable if there exists a hamiltonian path between any two vertices that are in different partite sets. A hamiltonian laceable graph G is said to be hyperhamiltonian laceable if, for any vertex v of G, there exists a hamiltonian path of G−{v} joining any two vertices that are located in the same partite set different from that of v. In this paper, we further im...

متن کامل

Hamiltonicity of hypercubes with a constraint of required and faulty edges

Let R and F be two disjoint edge sets in an n-dimensional hypercube Qn. We give two constructing methods to build a Hamiltonian cycle or path that includes all the edges of R but excludes all of F . Besides, considering every vertex of Qn incident to at most n − 2 edges of F , we show that a Hamiltonian cycle exists if (A) |R| + 2|F | ≤ 2n− 3 when |R| ≥ 2, or (B) |R| + 2|F | ≤ 4n− 9 when |R| ≤ ...

متن کامل

On the mutually independent Hamiltonian cycles in faulty hypercubes

Two ordered Hamiltonian paths in the n-dimensional hypercube Qn are said to be independent if i-th vertices of the paths are distinct for every 1 ≤ i ≤ 2n. Similarly, two s-starting Hamiltonian cycles are independent if i-th vertices of the cycle are distinct for every 2 ≤ i ≤ 2n. A set S of Hamiltonian paths and sstarting Hamiltonian cycles are mutually independent if every two paths or cycles...

متن کامل

Spanning paths in hypercubes

Given a family {ui, vi}i=1 of pairwise distinct vertices of the n-dimensional hypercube Qn such that the distance of ui and vi is odd and k ≤ n− 1, there exists a family {Pi}i=1 of paths such that ui and vi are the endvertices of Pi and {V (Pi)}i=1 partitions V (Qn). This holds for any n ≥ 2 with one exception in the case when n = k + 1 = 4. On the other hand, for any n ≥ 3 there exist n pairs ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 107  شماره 

صفحات  -

تاریخ انتشار 2008